Optimal control of queues in computer networks
نویسندگان
چکیده
The design of rate allocation and queue length control in computer networks is treated as a stochastic optimal control problem. The performance index is chosen to achieve the twin objectives of minimising queue length fluctuations and fully utilising the available bandwidth. Simple, practically realisable optimal control schemes are obtained for both LANs and WANs. An adaptive scheme is proposed where the auto-regressive parameters of the traffic, needed for gain calculations, are estimated by an LMS algorithm. Discrete event simulations are carried out to verify the fluid-flow models used in developing the controllers, to compare their performance against PI controllers proposed previously, and to study the effect of self-similar trafflc. Two key results are obtained. First, queue-length fluctuations, and hence potentially packet losses, are much smaller for the optimal feedforward controller than for the PI controller. Second, in contrast to uncontrolled queues, the queue length variance decreases with increasing Hurst parameter for selfsimilar trafflc.
منابع مشابه
Longest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملA Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks
In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes th...
متن کاملA Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time
This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...
متن کاملDistributed Voltage Control in Distribution Networks with High Penetration of Photovoltaic Systems
In this paper, a distributed method for reactive power management in a distribution system has been presented. The proposed method focuses on the voltage rise where the distribution systems are equipped with a considerable number of photovoltaic units. This paper proposes the alternating direction method of multipliers (ADMMs) approach for solving the optimal voltage control problem in a distri...
متن کاملA Gravitational Search Algorithm-Based Single-Center of Mass Flocking Control for Tracking Single and Multiple Dynamic Targets for Parabolic Trajectories in Mobile Sensor Networks
Developing optimal flocking control procedure is an essential problem in mobile sensor networks (MSNs). Furthermore, finding the parameters such that the sensors can reach to the target in an appropriate time is an important issue. This paper offers an optimization approach based on metaheuristic methods for flocking control in MSNs to follow a target. We develop a non-differentiable optimizati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001